Methods, systems and apparatus to facilitate ranked network priority

ABSTRACT

Methods, systems and apparatus are disclosed to facilitate ranked network priority. An example method includes calculating a rank of a first wireless device relative to a plurality of wireless devices based on a first bid value associated with the first wireless device, allocating a first bit rate to the first wireless device based on the rank of the first wireless device at a first time, and in response to detecting a change in availability of the first bit rate at a second time, applying a second bid value for a second bit rate when the first wireless device is located in a first geographic area, and applying a third bid value for the second bit rate when the first wireless device is located in a second geographic area different from the first geographic area.

RELATED APPLICATIONS

This patent arises from a continuation of U.S. patent application Ser.No. 13/252,467, entitled “METHODS, SYSTEMS AND APPARATUS TO FACILITATERANKED NETWORK PRIORITY,” which is hereby incorporated herein byreference in its entirety.

FIELD OF THE DISCLOSURE

This disclosure relates generally to network services, and, moreparticularly, to methods, systems and apparatus to facilitate rankednetwork priority.

BACKGROUND

In recent years, wireless service providers and/or, more generally,network providers have experienced a dramatic increase in wireless smartphone sales and a corresponding demand for abundant and fast dataservices. In some locations, the volume of mobile data traffic in 2014is projected to be forty (40) times that of mobile data trafficconsumption in 2009. Such demand causes and/or will likely cause astrain on the service providers to satisfy subscriber expectations.

Network providers employ a four-pronged approach to meet subscriberdemand or curtail subscriber usage of their network(s). A first approachemployed by the network providers includes improving networkcapabilities by installing additional network resources, such asadditional cell towers for examples relating to wireless services. Asecond approach employed by the network providers includes offloadingdata servicing to WiFi hotspots, which may not be under the ownershipand/or control of the network provider. A third approach includeslimiting authorized use of relatively high-bandwidth mobile applications(apps) on some smart phones unless connected to a WiFi network. Such anapproach is not well received by some subscribers. A fourth approachattempts to shape and/or otherwise curtail subscriber usage behaviorthrough one or more economic incentives, such as eliminating unlimiteddata pricing plans. In some examples, network providers have implementeda tiered pricing scheme, in which subscribers are limited to apredetermined amount of data per time period (e.g., 100 megabytes permonth).

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic illustration of an example wireless networkenvironment controlled in accordance with the teachings of thisdisclosure to facilitate ranked network priority services.

FIG. 2 is a schematic illustration of an example wireless device toreceive ranked network priority services.

FIG. 3 is a schematic illustration of an example tower resource managerto facilitate ranked network priority services in connection with FIGS.1 and 2.

FIG. 4 is a schematic illustration of an example auction manager tofacilitate ranked network priority services in connection with FIGS.1-3.

FIGS. 5-8 are flowcharts representative of example machine readableinstructions that may be executed to implement the example networkenvironment of FIG. 1, the example wireless device of FIG. 2, theexample tower resource manager of FIG. 3 and/or the example auctionmanager of FIG. 4.

FIG. 9 illustrates an example processor platform that may execute theinstructions of FIGS. 5-8 to implement any or all of the examplemethods, systems, and/or apparatus disclosed herein.

DETAILED DESCRIPTION

Methods, systems, apparatus, and articles of manufacture are disclosed,which include obtaining a candidate bid value associated with a firstwireless device, calculating a rank of the first wireless device with aplurality of wireless devices based on (a) the candidate bid value, (b)an operating characteristic of the first wireless device, and (c) ascheduling model, and allocating a first portion of wireless networkresources to the first wireless device based on the rank of the firstwireless device.

Although network providers, such as wireless service providers, Internetservice providers (ISPs), and/or other providers of subscriber-basedservices, apply one or more techniques to curtail customer data usagebehavior(s), such techniques affect an aggregate amount of data consumedover relatively long periods of time. Congestion, on the other hand, isa consequence of limited bandwidth (e.g., speed of delivery)availability that affects a user experience in a relatively short periodof time. For example, a network that currently has a relatively smallnumber of users (i.e., currently has a low level of congestion), such aswireless subscribers that currently share a common cell tower, is ableto provide data services without significant delay. As a result, useractions on their associated wireless devices respond relatively quicklyto one or more requests to send and/or receive data. For instance, usersthat browse web pages on their wireless device (e.g., smart phone)experience responses in a manner similar to a desktop web-browsingexperience when the shared cell tower currently services a relativelysmall number of wireless devices (e.g., currently have a low congestionlevel). In other words, cell towers that are not burdened with a largenumber of wireless devices may provide faster responses and/or fasterdata throughput than cell towers that are overburdened with users.

As a number of users serviced by the cell tower increases (highcongestion level), each wireless device competes with other wirelessdevices of that cell tower for a limited amount of shared resources thatthe cell tower can accommodate.

Some wireless network technologies manage one or more aspects ofsubscriber bandwidth by allocating a number of codes, such aschannelization codes in High Speed Downlink Packet Access (HSDPA) or 3G.To increase throughput for a particular user/subscriber/wireless device,an allocated number of channelization codes may be increased for thatuser/subscriber/wireless device. In some examples, throughput for aparticular user/subscriber/wireless device is controlled by a corenetwork, a gateway and/or a server.

While network providers may employ one or more tiered data plans, inwhich subscribers pay a fee for a monthly quantity of data (e.g., 5 Gbof data per 30-day period), such services are related to a volume ofdelivery and do not affect the subscriber's speed of delivery (e.g., arate of data access/bandwidth). In effect, a premium subscriber (e.g., asubscriber paying a fee in a costlier tier) will experience the samebandwidth benefits and/or limitations as a non-premium subscriber (e.g.,a subscriber paying a fee in a less expensive tier) at a particular celltower because the cell tower allocates bandwidth resources to usersindependent of one or more subscription plans.

Methods, apparatus, systems and/or articles of manufacture disclosedherein allow network providers and/or service providers to managebandwidth congestion. In some examples, methods, apparatus, systemsand/or articles of manufacture disclosed herein, wireless serviceproviders establish a valuation metric for data services based on ametric associated with congestion of the network, such as congestionmetrics associated with one or more wireless service nodes, systems,networks and/or cell towers of a wireless network (e.g., a wirelesstelephone network). Valuation metrics may include, but are not limitedto a base price to use one or more wireless services, and/or a pricebased on users competing for wireless resources. Additionally,subscribers of the network provider may provide one or more bids toadjust a level of bandwidth performance associated with a wirelessdevice. In some examples, network element(s) (e.g., nodeB device, eNodeBdevice, radio network controller, serving general packet radio service(GPRS) support node (SGSN), universal terrestrial radio access network(UTRAN), evolved UTRAN (eUTRAN), radio network controller (RNC), etc.)may accept a subscriber bid having more than a threshold value. Whensuch a bid is accepted, the network element(s) allocate additionalnetwork resources and/or permit increased data bandwidth throughput forthe winning subscriber, thereby providing improved data bandwidthperformance to the wireless device of the winning subscriber. Asdescribed in further detail below, one or more example biddingtechniques employ a Generalized Second Price (GSP) auction technique todiscover prices acceptable to subscribers for one or more bandwidthservices (e.g., premium services, average services, budget services,etc.), thereby relieving and/or even minimizing congestion effects forthose subscribers willing to pay a higher price for a correspondinghigher network priority.

In the illustrated example of FIG. 1, an example wireless networkenvironment 100 includes a first cellular (cell) tower 102, a secondcell tower 104 and a third cell tower 106. Each of the first, second andthird cell towers 102, 104, 106 is communicatively connected to a firsttower interface 108, a second tower interface 110 and a third towerinterface 112, respectively. Generally speaking, the first, second andthird tower interface 108, 110, 112 facilitate communication between oneor more wireless devices and a core network 113 associated with awireless service provider. The example tower interfaces 108, 110, 112may include, but are not limited to 2G wireless technologies, 3Gwireless technologies, 4G wireless technologies and/or combinationsthereof. Example 3G wireless technologies may be employed by a UTRANtower interface, such as the example UTRAN 170 shown in FIG. 1. Theexample UTRAN 175 tower interface 108 of FIG. 1 includes a nodeB 150 anda radio network controller 152. In other examples, the example towerinterface 108 may include an eUTRAN 172 that includes an eNodeB 174.While the example tower interface 108 of FIG. 1 illustrates UTRAN 170and eUTRAN 172 configurations, such configurations may be employed withexample tower interface 110 and/or example tower interface 112, withoutlimitation. The example core network 113 may be communicativelyconnected to a network 114, such as a wireless service provider network,one or more intranets and/or the Internet. Connection may include one ormore firewalls (not shown). The example core network 113 may include anynumber of network elements including those related to any type ofwireless technology such as, for example, 2G, 3G, 4G, LTE, etc. Theexample core network 113 of FIG. 1 may include 3G network component(s)including, but not limited to, a gateway general packet radio servicesupport node (GGSN) 156, and/or a serving general packet radio servicesupport nodes (SGSNs) 154. In other examples, the core network 113 mayinclude 4G wireless network technologies and corresponding elementsincluding, but not limited to, a mobility management entity (MME) 176, apacket data network (PDN) gateway 178, a serving gateway (SGW) 180and/or a policy charging and rules function (PCRF) 182. In someexamples, one or more of the first, second and/or tower interfaces 108,110, 112 communicatively connect to the example network 114 prior toconnecting with the example core network 113. The example core network113 of FIG. 1 may include one or more additional and/or alternatenetwork elements including, but not limited to, an internal backbonenetwork 184, multi-service proxies, intermediate network elements,and/or routers. Each of the first, second and/or third cell towers 102,104, 106 facilitates wireless communication services for a finitegeographic region within which the cell towers 102, 104, 106 andassociated radio(s) therein may establish a first, second and/or thirddata communication cell area 116, 118, 120, respectively.

The example first, second and/or third data communication cell areas116, 118, 120 of FIG. 1 may include any number of wireless devices that,when communicating with a cell tower, share communication resources ofthe cell tower and its associated tower interface. In the illustratedexample of FIG. 1, the first data communication cell area 116 includesone wireless device 122, the second data communication cell area 118includes three (3) wireless devices 124 a-c, and the third datacommunication cell area 120 includes six (6) wireless devices 126 a-f.Generally speaking, a tower interface and its associated cell tower mayaccommodate far greater numbers of wireless devices than shown in theillustrated example of FIG. 1. However, for purposes of explanation, andnot limitation, a quantity of six (6) wireless devices in the examplethird data communication cell area 120 is deemed to overload and/orotherwise stress the example third cell tower 106 and the associatedthird tower interface 112. As used herein, an overloaded cell towerresults in one or more connected wireless devices experiencing lowbandwidth due to competition from other wireless devices sharing thecombined communication resources of the cell tower and its associatedtower interface. On the other hand, for purposes of explanation, and notlimitation, a quantity of one wireless device in the example first datacommunication cell area 116, and a quantity of three (3) wirelessdevices in the example second data communication cell area 118 aredeemed to allow satisfactory bandwidth rate(s) for all users.

The example first, second and third tower interfaces 108, 110, 112 mayrepresent any type of network technology including, but not limited toGSM/GPRS networks, Code Division Multiple Access (CDMA) networks,third-generation (3G) networks (e.g., EDGE, UMTS, etc.),fourth-generation (4G) networks, Personal Communication Systems (PCS)networks, Time Division Multiple Access (TDMA) networks and/or 3GPP LongTerm Evolution (LTE) networks. In the illustrated example of FIG. 1, thewireless network environment 100 includes High Speed Downlink PacketAccess (HSDPA) technology that employs packet schedulers in a towerinterface, sometimes referred to herein as a nodeB. HSDPA nodeBschedules wireless channels to users at 2 millisecond intervals toprovide data rates between 2 Mbps and 10 Mbps. However, one or morealternate wireless network technologies may be employed and/or mayfacilitate faster or slower data rates.

Continuing with the aforementioned HSDPA example, data throughput forany particular user/subscriber may be increased via code allocationand/or bandwidth throttling by one or more network elements, such as theexample nodeBs 150 and/or the example GGSN 156. The packet scheduler ofthe example nodeB (e.g., the first, second, and/or third tower interface108, 110, 112) and/or GGSN 156 allocates resources to one or moreusers/subscribers (e.g., wireless device(s) in a particular geographicarea served by or corresponding tower interface and/or associated celltower) in a manner that promotes fairness (e.g., equal network access)among the individual users while attempting to maintain high overallthroughput for all users. Example scheduling policies employed bynetwork devices (e.g., nodeBs 150, GGSNs 156, eNodeBs 174, etc.) includeround robin (RR) policies, max throughput (MT) policies and proportionalfair (PF) policies. The example RR policy causes the network element(s)to prioritize all user devices (e.g., wireless telephones) equally,regardless of a channel quality associated with that wireless device.For example, devices that are relatively far away from a cell tower areafforded the same priority as devices that are relatively close to thecell tower. Generally speaking, the RR policy sacrifices data throughputwhile promoting fairness for each of the devices within communicationrange of the cell tower and its associated network element(s) (e.g.,nodeBs 150, eNodeBs 174, RNCs 152, etc.).

The example MT policy causes the network element(s) to prioritizeresource allocation based on a maximum throughput (e.g., bit rate). As aresult, the example MT policy results in a disadvantage for devices nearan edge of a cell tower boundary because, in part, channel qualitiesassociated with the device are typically inferior when compared tochannel qualities associated with devices that are physically closer tothe cell tower. Additionally, the example MT policy provides arelatively good throughput at the expense of fairness to those deviceshaving inferior channel qualities due to distance and/or interference(e.g., building materials).

The example PF policy causes the network element(s) to prioritizeresource allocation based on a ratio of device instantaneous throughputof data and device average throughput of data. In effect, the example PFpolicy weighs the current achievable bit rate by the average ratereceived by that device. The average rate may be calculated over anytime period as, for example, a moving average. Additionally, the examplePF policy provides a balance between maximizing system throughput andfairness.

Example methods, apparatus, systems and/or articles of manufacturedisclosed herein modify network element polic(ies) (e.g., at the nodeB,at the eNodeB, at the GGSN, etc.) by considering, in part, bidssubmitted by users/subscribers having connectivity to a cell tower whendetermining how to allocate bandwidth among user devices. Additionallyor alternatively, example methods, apparatus, systems and/or articles ofmanufacture disclosed herein modify data rates allocated to one or morewireless devices associated with the users/subscribers based on theaccepted bids. Allocation of network element (e.g., nodeB) channelresources can be considered as occurring sequentially (e.g., a sequenceof 2 ms frames in 3G networks). However, service providers typicallyhave no prior knowledge of an amount of money users are willing to payfor privileged access to the network element channel resources and/or adata rate. Additionally, while bidding facilitates an ability toidentify a value for data rate resources, expecting a user to submit abid for each instance of a data frame privilege (e.g., a channelresource) every 2 ms is impractical. As such, example methods,apparatus, systems and/or articles of manufacture disclosed herein treatthe wireless sequential frame frequency and/or frame allocation as amulti-unit differentiated product (MUDP) that involve resourceallocation decisions across a number of rounds that are larger thantheir lowest (most granular) resolution (e.g., 2 ms). For example, anauction of MUDP resources may establish a single bid to be applied onbehalf of the user for any number of 3G frame sequences, with one ormore options to change the bid price when desired. In other examples,data rate control and/or allocation may be realized by way of datathrottling via core network element control. For example, data ratecontrol may be guided by policy enforcement related to a correspondingcommunication area (e.g., 116, 118, 120), based on bid values, based onwireless device technology types (e.g., 2G devices, 3G devices, 4Gdevices, LTE devices, etc.) and/or capabilities of the wireless devices.In some examples, if the wireless device lacks a capability to processand/or otherwise handle a particular data rate, one or more services maybe throttled and/or otherwise tailored when provided to that wirelessdevice.

The MUDP resource auction of the illustrated example is facilitated via,for example, a Generalized Second Price (GSP) auction-based mechanism todiscover acceptable prices from the network users for one or moreavailable services and/or network privileges. In part, the GSP auctionallows the highest bidder to pay an amount equal to the bid submitted bya next highest bidder. In the illustrated example, the actual pricecharged to the user never exceeds the maximum price specified in thebid. The prices for privileged network access are revealed by consumerdata (actual consumer bids as opposed to marketing guesswork) in theexample of FIG. 1 network providers can offer a differentiated bandwidthservice in real-time between the cell tower and each user deviceconnected thereto. Employing GSP auctions also allows for managinggeographic congestion disparity, such as the effects of congestion thatchange when a user travels from a rural area to an urban area. Forexample, prices based on congestion issues are likely different in lesspopulated areas (e.g., West Lafayette, Ind.) than they are in morepopulated areas (e.g., Manhattan, N.Y.). For example, populationdensities near cell towers in Manhattan are typically substantiallygreater than population densities in West Lafayette, thereby resultingin congestion issues in Manhattan that are rare or non-existent in WestLafayette.

In the illustrated example of FIG. 1, a first core resource manager 128a, a second core resource manager 128 b and a third core resourcemanager 128 c of the core network 113 are communicatively connected toand/or otherwise associated with the first tower interface 108, thesecond tower interface 110 and the third tower interface 112,respectively. In operation, the example core resource managers 128 a-cmeasure an indication of bandwidth activity rate (e.g., congestion)associated with a communication cell area (e.g., the first communicationcell area 116, the second communication cell area 118, or the thirdcommunication cell area 120) and/or measure an indication of bandwidthactivity rate associated with one or more elements of the core 113, andpublish the same to one or more wireless devices within range of acorresponding tower interface 108, 110, 112. For example, the coreresource manager 128 a associated with the first data communication cellarea 116 only includes a small number of wireless devices 122 and, as aresult, does not measure an activity indicative of heavy congestion. Onthe other hand, the core resource manager 128 c associated with thethird data communication cell area 120 includes many wireless devices126 a-f and, as a result, measures an activity rate indicative ofheavier congestion as compared to the first data communication cell area116. The example indication of congestion may include a value inmegabits per second (Mb/s) and one or more degrees of congestion may beidentified in view of threshold values with which to compare themeasured bandwidth and/or data rate. In some examples, a measured datarate is published to subscribers/users within range of the cell tower.If the measured data rate exceeds one or more threshold values, then thepublished rate is presented to the subscribers/users as a value and/or agraphical image on their mobile device. In other examples, an indicationof price is published to one or more wireless devices that is derivedfrom existing bid values and/or existing bandwidth capacity valuesassociated with capabilities of the core resource managers 128 a-c.

Briefly turning to FIG. 2, an example wireless device 200 is illustratedwith a display 202, and a user interface area 204 (e.g., keypad,trackpad, menu button(s), touchscreen, etc.). While the illustratedexample of FIG. 2 includes a separate display 202 and user interfacearea 204, example wireless devices may include any configuration and/orvariation of display and user interface area, such as, for example, auser interface area that includes one or more virtual buttons, virtualkeyboard buttons, etc., that may be touch activated as in an iPhone orother device. The example display 202 of FIG. 2 includes a status bar206, which may inform a user of one or more status values such as, butnot limited to time, date, temperature, WiFi signal availability, WiFisignal strength, and/or wireless provider signal strength 208.Additionally, the example status bar 206 of FIG. 2 includes a priceindicator 210, and a bandwidth tier indicator 212.

In the illustrated example of FIG. 2, the price indicator 210 is amonetary value to represent a cost of joining and/or otherwiseparticipating at a higher and/or lower tier of service. While theillustrated example of FIG. 2 includes a dollar sign ($), the priceindicator 210 may include one or more cost values for corresponding tierservices. As described above, the example core resource managers 128 a-cmeasure activity values (e.g., levels) and, depending on whether thevalues exceed one or more thresholds, and/or depending on one or morecurrent bids from other users, and/or depending on a base price toreceive one or more services associated with a tier level, acorresponding price indicator 210 may be presented in the example statusbar 206.

In the illustrated example of FIG. 2, the bandwidth tier indicator 212informs a user of a type of bandwidth service enabled on the wirelessdevice. For example, a first tier may represent a lowest level ofpriority for data communications for the user/subscriber, a fourth tiermay represent a highest level of priority for data communications, andone or more gradients of intermediate tier levels may residetherebetween (e.g., tier 1.5, 2.0, 2.5, etc.). In some examples, thebandwidth tier indicator 212 may flash, change color and/or the wirelessdevice may beep and/or vibrate when an opportunity to increase a tierplan in an effort to secure a higher data processing priority for thewireless device.

Alternate example bandwidth tier indicators 216 a-d may correspond toindicator variations. In some examples, the user/subscriber may invoke abid via a button press of the example wireless device 200, as describedin further detail below. In the example of FIG. 2, example app indicator218 corresponds to a bidding application that allows the user/subscriberto enter a bid value amount in an effort to increase a current tierstatus, decrease a current tier status and/or otherwise manage one ormore bids. In the event that the entered bid amount is sufficient toraise a current tier status, the example bandwidth tier indicator 212may change an appearance, such as from the alternate example indicator216 a to the example indicator(s) 216 b-d. The bidding application ofthe illustrated example executes on the wireless device 200 andcommunicates with the example core resource manager(s) 128 a-c via acell tower.

In the illustrated example of FIG. 1, an example auction manager 130 iscommunicatively connected to the core network 113, which enablescommunicative access from the auction manager 130 to one or more coreresource manager(s) 128 a-c, to/from the network(s) 114, and/or to/fromone or more wireless devices 122, 124 a-c, 126 a-f. In operation, theexample auction manager 130 establishes new subscriber profiles and/orpropagates subscriber profile information throughout the examplewireless network environment 100. Profile information may include, butis not limited to, bidding preferences, geographic bidding preferences,payment information, etc. For example, a subscriber profile may indicatethat an automatic bid of a predetermined amount may be presented inresponse to a tier status decrease (e.g., a tier status decrease fromlevel 4 to level 3). Additionally, the example subscriber profile mayindicate that, in the event of a tier level drop, automatic bids in afirst predefined amount (e.g., $3.50) are authorized when in a firstgeographic location (e.g., Manhattan), and automatic bids in a secondpredefined amount (e.g., $1.50) are authorized when in a secondgeographic location (e.g., West Lafayette, Ind.). In still otherexamples, the example subscriber profile may indicate that an automaticbid of a predetermined amount may be implemented based on a time of dayand/or a time of day for one or more geographic locations.

FIG. 3 is a schematic illustration of an example implementation of anyor all of the core resource manager(s) 128 a-c of FIG. 1. In theillustrated example of FIG. 3, the core resource manager 128 a-cincludes a bandwidth monitor 302, a bandwidth publisher 304, aconnection request monitor 306 and a subscriber query engine 308. Theexample subscriber query engine 308 may be communicatively connected tothe core network 113, which may further enable communication with theexample auction manager 130, a home location register (HLR) and/or avisitor location register (VLR) 310. Additionally, in the illustratedexample of FIG. 3, the core resource manager 128 a-c includes a bidinterface manager 312, a local subscriber storage 314, a bandwidthallocation engine 316, and an auction engine 318. Some examples includemeans for monitoring bandwidth, means for publishing bandwidthinformation, means for monitoring connection request(s), means formanaging subscriber queries, means for managing bids, means forallocating bandwidth, means for facilitating auction types, and/or meansfor managing auction preferences. In the illustrated example of FIG. 3,the means for monitoring bandwidth is the example bandwidth monitor 302,means for publishing bandwidth information is the example bandwidthpublisher 304, means for monitoring connection request(s) is the exampleconnection request monitor 306, means for managing subscriber queries isthe example subscriber query engine 308, means for managing bids is theexample bid interface manager 312, means for allocating bandwidth is theexample bandwidth allocation engine 316, means for facilitating auctiontypes is the example auction engine 318, and means for managing auctionpreferences is the example auction manager 130. Each of the means formonitoring bandwidth, means for publishing bandwidth information, meansfor monitoring connection request(s), means for managing subscriberqueries, means for managing bids, means for allocating bandwidth, meansfor facilitating auction types, and/or means for managing auctionpreferences may be implemented by the processor P100 of FIG. 9 executingthe instructions of FIGS. 5-8.

In operation, the example core resource manager 128 a-c employs theexample bandwidth monitor 302 to measure a bandwidth rate (e.g.,Mb/second) of the corresponding tower interface, the corresponding coreresource manager, and/or data communication cell area with which thecore resource manager is associated. For example, the bandwidth monitor302 of the core resource manager 128 c measures the rate of incomingand/or outgoing data processed by a corresponding tower interface 108,110, 112 to determine a degree of utilization. Depending on one or morebandwidth capabilities of the tower interface 108, 110, 112, one or morethresholds of bandwidth may be monitored to identify circumstancesindicative of congestion. As used herein, congestion occurs when anamount of data processed by a tower interface and/or its associated corenetwork elements (e.g., nodeBs, eNodeBs, radio network controllers(RNCs), SGSNs, SGWs, etc.) is near or at a maximum value of capability.

The example bandwidth publisher 304 of FIG. 3 publishes and/or otherwisecommunicates an indication of a degree of congestion, current tier leveland/or price per tier opportunities to one or more wireless devicesnearby. For example, the bandwidth publisher 304 of the first coreresource manager 128 a publishes an indication of the degree ofcongestion associated with the first tower 102 to the wireless device122 in the first data communication cell area 116, the bandwidthpublisher 304 of the second core resource manager 128 b publishes anindication of the degree of congestion associated with the second tower104 to the wireless devices 124 a-c in the second data communicationcell area 118, and the bandwidth publisher of the third tower resourcemanager 128 c publishes the indication of the degree of congestionassociated with the third tower 106 to the wireless devices 126 a-f inthe third data communication cell area 120. The indication of the degreeof congestion may be published by the example bandwidth publisher 304 asa value illustrating a quantity of data per unit of time, analphanumeric indicator(s), and/or a graphic. In some examples, one ormore threshold data rates cause the bandwidth publisher 304 to generatea green icon (e.g., not congested), yellow icon (e.g., moderatelycongested) or red icon (e.g., substantially congested) based on whetherone or more threshold(s) are exceeded or not exceeded. In otherexamples, the bandwidth publisher 304 includes a web server to publishthe indication of the degree of congestion associated with the tower,thereby allowing one or more users to access information in a web-basedmanner.

The example connection request monitor 306 of the core resource managers128 a-c of FIG. 3 determines whether one or more wireless devices makesan attempt to connect to a tower. Requests to connect to the tower mayinclude, but are not limited to, one or more users attempting to place acall via a wireless device, one or more users attempting to utilize dataservices with their wireless device, and/or one or more wireless devicesregistering with the tower (e.g., during device power-on, during celltower device hand-off, etc.). If one or more wireless devices do notmake an attempt to connect to a tower, the example core resourcemanager(s) 128 a-c continue to measure data rates. In the event aconnection attempt is made, the example subscriber query engine 308determines whether the connection request is associated with asubscriber. For example, a subscriber may have a profile to indicate, inpart, data connection privileges, preferred data connection rate(s)and/or default bidding instructions. One or more profiles may be storedin the example local subscriber storage 314, which may becommunicatively connected to the example subscriber query engine 308. Insome examples, the subscriber query engine 308 is communicativelyconnected to the network 114, and accesses an HLR/VLR 310 and/or theauction manager 130, which may contain one or more profiles. On theother hand, non-subscribers attempting to connect to the tower may beprovided with an opportunity to provide one or more bids in an effort toreceive data services having greater or lesser capabilities.

In the event the connection attempt is associated with a subscriberhaving a profile, the example bandwidth allocation engine 316 of FIG. 3allocates bandwidth privileges per the profile parameter(s). The profileparameter(s) may indicate a preferred tier level of service with whichthe subscriber should be associated. On the other hand, in the event theconnection attempt is associated with a subscriber without a profile,the example bid interface manager 312 provides the subscriber with oneor more opportunities to select a preferred tier level of service. Oneor more preferred tier level of service selection(s) by the subscriberand/or identified by a profile may be processed by the example bandwidthallocation engine 316 to allocate a number of codes (e.g., HSDPAchannelization codes) in a manner proportionate to a tier level ofservice associated with the user or subscriber. In other examples, thebandwidth allocation engine 316 controls one or more elements of thecore network 113 to throttle and/or otherwise control a data rateassociated with a wireless device associated with the subscriber ornon-subscriber. For example, the bandwidth allocation engine 216 maycause and/or otherwise control the example RNC 152 (for UTRANs) or theexample eNodeB 174 (for eUTRANs) to allow a certain bit rate through acorresponding network element (e.g., nodeB, RNC, etc.) to the wirelessdevice.

In the event that a bid is received by the example auction engine 318from a subscriber or a non-subscriber (e.g., a bid received to increasea tier level of service in a particular geographic location), theexample auction engine 318 ranks each of the existing users of thetower. User and/or device ranking provides, in part, an indication ofvalue each user places on receiving data services facilitated by thetower area capability. For example, higher ranked users spend more moneyin return for a tier level of service that provides a greater number ofchannelization codes and/or controlled bit rate(s) than lower rankedsubscribers, thereby resulting in faster data service performance. Onthe other hand, lower ranked users spend less money and, as a result,are not entitled to the same tier level of service and/or correspondingdata service performance abilities as higher paying users. As describedin further detail below, in the event a bid entered by a user/subscriberis successful, then the user/subscriber's tier level of serviceincreases and the example bandwidth allocation engine 316 allocates acorresponding increased number of channels and/or causes a data rate toincrease via one or more elements of the core network 113. On the otherhand, if the bid entered by a user/subscriber is too low to increase thecurrent tier level of service (e.g., when compared to the existingand/or competing users of the tower), then the example bandwidthallocation engine 316 refrains from allocating additional channels toand/or increasing a data rate of that user/subscriber.

FIG. 4 is a schematic illustration of an example implementation of theauction manager 130 of FIG. 1. In the illustrated example of FIG. 4, theauction manager 130 includes a subscriber interface 402, a profilemanager 404, a profile store 406 and a core resource interface 408. Someexamples include means for interfacing a subscriber, means for managinga subscriber profile and/or means for interfacing core resources. In theillustrated example of FIG. 4, the means for interfacing a subscriber isthe example subscriber interface 402, the means for managing asubscriber profile is the example profile manager 404, and the means forinterfacing core resources is the example core resource interface 408.Each of the means for interfacing a subscriber, means for managing asubscriber profile and/or means for interfacing core resources may beimplemented by the processor P100 of FIG. 9 executing the instructionsof FIGS. 5-8. In operation, the example subscriber interface 402provides one or more user interfaces and/or graphical user interfaces(GUIs) for an existing subscriber and/or user(s) that do not yet havesubscriber status. GUIs may be facilitated by, for example, a web serveraccessible by personal computers and/or wireless devices (e.g., wirelesstelephones). Wireless service subscribers associated with a particularwireless service provider may have a subscriber status for one or moreservices to facilitate ranked network priority by virtue of theirservice contract. On the other hand, users may establish an accountand/or develop a profile so that ranked network priority services can bepurchased, bid and/or otherwise used when the user is withincommunication range of a tower 102, 104, 106 and/or a correspondingtower interface 108, 110, 112. As a result, some or all users are freeto jump from service provider to service provider based onwinning/losing bids.

The example profile manager 404 of FIG. 4 includes one or more forms,templates and/or questions to be presented to a user that facilitateprofile development. For example, the profile manager 404 of FIG. 4presents the user with choices for incremental bid increase amounts(e.g., in a currency of interest, such as a dollar, a Euro, etc.) in theevent an initial bid is unsuccessful due to congested conditions. Inanother example, the profile manager 404 of FIG. 4 presents the userwith a bid price cap selection. In effect, if one or more repeatedincremental bid increases continue, the profile may instruct the examplecore resource manager 128 a-c to stop accepting bids when an upper bidthreshold is reached. Details related to the one or more profilesdeveloped by the example profile manager 404 may be stored in theexample profile store 406. Additionally, the example core resourceinterface 408 of FIG. 4 propagates profile information to the examplewireless network environment 100. For example, when a subscriber havinga profile travels from one communication cell area to anothercommunication cell area, the core resource interface 408 of theillustrated example transfers and/or otherwise provides profileinformation stored in the profile store 406 to an associated coreresource manager 128 a-c. In other examples, the core resource interface408 provides subscriber profile information to one or more HLR and/orVLR elements of a wireless network, such as the example HLR/VLR 310.

While an example manner of implementing the example core resourcemanager(s) 128 a-c and the example auction manager 130 have beenillustrated in FIGS. 1-4, one or more of the elements, processes and/ordevices illustrated in FIGS. 1-4 may be combined, divided, re-arranged,omitted, eliminated and/or implemented in any other way. Further, theexample core resource manager(s) 128 a-c, the example auction manager130, the example bandwidth monitor 302, the example bandwidth publisher304, the example connection request monitor 306, the example subscriberquery engine 308, the example bid interface manager 312, the examplelocal subscriber store 314, the example bandwidth allocation engine 316,the example auction engine 318, the example subscriber interface 402,the example profile manager 404, the example profile store 406 and/orthe example core resource interface 408 of FIGS. 1-4 could beimplemented by one or more circuit(s), programmable processor(s),application specific integrated circuit(s) (ASIC(s)), programmable logicdevice(s) (PLD(s)) and/or field programmable logic device(s) (FPLD(s)),etc. When any of the apparatus or system claims of this patent are readto cover a purely software and/or firmware implementation, at least oneof the example auction manager 130, the example bandwidth monitor 302,the example bandwidth publisher 304, the example connection requestmonitor 306, the example subscriber query engine 308, the example bidinterface manager 312, the example local subscriber store 314, theexample bandwidth allocation engine 316, the example auction engine 318,the example subscriber interface 402, the example profile manager 404,the example profile store 406 and/or the example core resource interface408 of FIGS. 1-4 are hereby expressly defined to include a tangiblecomputer readable medium such as a memory, DVD, CD, etc. storing thesoftware and/or firmware. Further still, the example wireless networkenvironment 100 of FIG. 1 may include one or more elements, processesand/or devices in addition to, or instead of, those illustrated in FIGS.1-4, and/or may include more than one of any or all of the illustratedelements, processes and devices.

Flowcharts representative of example machine readable instructions forimplementing the wireless network environment 100 of FIG. 1, any of theexample core resource manager(s) 128 a-c of FIGS. 1 and 3, and/or theexample auction manager 130 of FIGS. 1 and 4 are shown in FIGS. 5-8. Inthese examples, the machine readable instructions comprise a program forexecution by a processor such as the processor P105 shown in the examplecomputer P100 discussed below in connection with FIG. 9. The program maybe embodied in software stored on a tangible computer readable mediumsuch as a CD-ROM, a floppy disk, a hard drive, a digital versatile disk(DVD), or a memory associated with the processor P105, but the entireprogram and/or parts thereof could alternatively be executed by a deviceother than the processor P105 and/or embodied in firmware or dedicatedhardware. Further, although the example program is described withreference to the flowcharts illustrated in FIGS. 5-8, many other methodsof implementing the example wireless network environment 100 and/or theexample core resource manager(s) 128 a-c and/or the example auctionmanager 130 may alternatively be used. For example, the order ofexecution of the blocks may be changed, and/or some of the blocksdescribed may be changed, eliminated, or combined.

As mentioned above, the example processes of FIGS. 5-8 may beimplemented using coded instructions (e.g., computer readableinstructions) stored on a tangible computer readable medium such as ahard disk drive, a flash memory, a read-only memory (ROM), a compactdisk (CD), a digital versatile disk (DVD), a cache, a random-accessmemory (RAM) and/or any other storage media in which information isstored for any duration (e.g., for extended time periods, permanently,brief instances, for temporarily buffering, and/or for caching of theinformation). As used herein, the term tangible computer readable mediumis expressly defined to include any type of computer readable storageand to exclude propagating signals. Additionally or alternatively, theexample processes of FIGS. 5-8 may be implemented using codedinstructions (e.g., computer readable instructions) stored on anon-transitory computer readable medium such as a hard disk drive, aflash memory, a read-only memory, a compact disk, a digital versatiledisk, a cache, a random-access memory and/or any other storage media inwhich information is stored for any duration (e.g., for extended timeperiods, permanently, brief instances, for temporarily buffering, and/orfor caching of the information). As used herein, the term non-transitorycomputer readable medium is expressly defined to include any type ofcomputer readable medium and to exclude propagating signals.

The program 500 of FIG. 5 begins at block 502 where the examplebandwidth monitor 302 measures a bandwidth rate associated with acommunication cell area, such as the example communication cell areas116, 118, 120 of FIG. 1. As described above, a bandwidth rate may bemeasured to yield a value indicative of an amount of data transfer(e.g., through the cell tower) per unit of time, such as bits/second,kilobits/second (Kb/s), megabits/second (Mb/s), etc. To keepusers/subscribers apprised of a current rate associated with thecommunication cell area with which they are associated, the examplebandwidth publisher 304 publishes and/or otherwise makes available oneor more values associated with the measured bandwidth, current tierstatus and/or current price per tier (block 504). The example bandwidthpublisher 304 may transmit information indicative of the bandwidth rateto one or more wireless devices within the communication range of thedata communication cell area and/or may employ a web server to make suchinformation accessible via web-enabled devices. As described above, whenthe example bandwidth publisher 304 transmits, broadcasts and/orotherwise publishes information indicative of bandwidth to the one ormore wireless devices, a corresponding price indicator 210 may appear onone or more wireless devices within the communication range of the area.One or more thresholds may be used to augment the price indicator 210 toillustrate a current cost associated with using corresponding tierservices of a core resource manager 128 a-c. In other examples, theexample bandwidth monitor may provide one or more indications ofbandwidth congestion. Degrees of congestion may be shown on the examplestatus bar 206 such as, a red congestion indicator indicative of anamount of data traffic per unit of time that is at or near a maximumcapacity for the tower and/or tower equipment (e.g., nodeB devices,RNCs, eNodeBs, etc.). In another example, a green congestion indicatormay be shown in the status bar 206 that is generally indicative of anamount of data traffic per unit of time that is at or near a low-endthreshold of capacity for which the tower can accommodate.

The example connection request monitor 306 detects and/or otherwiseidentifies a connection request from a wireless device (block 506). Ifno connection request occurs (block 506), then the example core resourcemanager 128 a-c continues to measure a bandwidth, verify a current tierstatus and/or determine a congestion status on a periodic, aperiodic,scheduled and/or manual basis (block 502). On the other hand, in theevent the example connection request monitor 306 detects and/orotherwise identifies a connection request from a wireless device (block506), then the example subscriber query engine 308 identifies whetherthe connection request originates from a subscriber associated with theservice provider that owns and/or otherwise manages the datacommunication cell area (block 508). At least one reason for determiningwhether the connection request is associated with a wireless subscriberincludes one or more price breaks and/or data throughput accessprivileges afforded to wireless subscribers. In some examples, wirelesssubscribers enjoy a financial benefit when using similarlyowned/operated wireless resources (e.g., cell towers, network resources,tower interfaces, etc.), while non-subscribers may require one or moreadditional fees to enjoy a similar bandwidth benefit.

In the event the request is associated with a wireless subscriber, thenthe example subscriber query engine 308 may search the example localsubscriber store 314 for an indication of whether the subscriber has anassociated priority profile (block 510). Additionally, the examplesubscriber query engine 308 may perform one or more queries via thenetwork 114 to the profile store 406 of the example auction manager 130and/or query one or more HLR/VLRs 310 of the network 100 to determinewhether the subscriber has an associated priority profile. If so, thenthe example bandwidth allocation engine 316 allocates bandwidthprivileges per one or more instructions and/or parameters of thesubscriber profile (block 512). On the other hand, if the subscriberdoes not have an associated profile (block 510), then the example bidinterface manager 312 provides a bandwidth selection option tofacilitate default network priority services, or to configure specificnetwork priority services (block 514).

In some examples, default network priority services are controlled byand/or otherwise dictated by a local policy associated with the exampledata communication cell area. For example, in rural areas the defaultnetwork priority services attempt to provide a subscriber withscheduling options based on equality/access among all users. Forinstance, a round robin (RR) scheduling technique implemented by theexample core resource manager 128 a-c, a tower interface and/or anetwork element (e.g., nodeB, eNodeB, etc.) prioritizes all wirelessdevices equally. The RR scheduling emphasizes fairness (e.g., equalnetwork accessibility) to all wireless devices over one or moreconsiderations related to channel qualities. As such, even when onewireless device has particularly poor channel qualities due to, forexample, residing near the edge of the data communication cell area,that wireless device will be given the same priority as another wirelessdevice having superior channel qualities.

In other examples, a maximum throughput (MT) scheduling technique isemployed as the default network priority. The example MT schedulingtechnique allocates resources in a manner that prioritizes throughput atthe expense of fairness to all wireless devices. In the event a firstwireless device has particularly poor channel characteristics due to,for example, residing near the edge of the data communication cell area,then resources for that first wireless device are reallocated to one ormore other wireless devices capable of handling a greater amount of datathroughput.

In still other examples, a proportional fair (PF) scheduling techniqueis employed as the default network priority. The example PF schedulingtechnique allocates resources based on a ratio of the instantaneousthroughput of data for a wireless device, and a measured average ofthroughput for that wireless device. In other words, an average rate iscomputed over a time period as a moving average to provide a balancebetween maximizing system throughput and fairness.

Although the default network priority techniques described above includeRR, MT and/or PF, such default scheduling techniques are not limitedthereto. For example, one or more hybrid resource allocation techniquesmay be employed, such as implementing the MT scheduling technique untilthe tower reaches a threshold capacity, and then allocating resources ina different manner as a number of users and their associated wirelessdevices increase. In other examples, the core resource managers 128 a-creserve 25% of their available bandwidth on a first-come, first-servedbasis, and allocate 75% of their capable bandwidth in a manner thatassigns network priority based on bid rank values. In still otherexamples, scheduling techniques may employ one or more of theaforementioned RR, MT and/or PF techniques in addition to bandwidthand/or data rate throttling. For instance, the tower interfaces 108,110, 112, the core resource managers 128 a-c and/or one or more elementsof the core network 113 may constrain or permit varying data rates toone or more wireless devices. The degree of data rate constraint orpermission may be based on bid value(s) received from the user of thewireless devices, operating characteristics of the wireless device, thescheduling model and/or any combination thereof.

In the illustrated example of FIG. 5, in the event a default networkpriority service is selected (block 516), the example bandwidthallocation engine 316 allocates resources based on one or more defaultscheduling technique(s) (block 518). On the other hand, in the eventnetwork priority services are selected (block 516), then the examplecore resource manager 128 a-c publishes tier pricing information (block519) and the auction engine 318 processes one or more bids and allocatesresources based on the bids, wireless device operating characteristic(s)and/or scheduling model(s) operating within the correspondingcommunication cell area 116, 118, 120 (block 520), as described infurther detail below.

In the event that the example subscriber query engine 308 identifiesthat the connection request originates from a user unaffiliated with thewireless service provider that owns and/or otherwise manages the corenetwork 113, the corresponding core resource manager 128 a-c and/or thecorresponding tower interface 108, 110, 112 (block 508), then theexample bid interface manager 312 of the core resource manager 128 a-cdetermines whether users unaffiliated with the wireless serviceproviders (foreign users) may be afforded an opportunity to participatein ranked network priority services (block 522). In some examples, awireless service provider may distinguish their services based on theability to offer their own subscribers the opportunity for faster and/orotherwise premium user experiences by way of the ranked network prioritybidding process disclosed herein. In such examples, the wireless serviceprovider may implement a policy within the communication cell area(e.g., 116, 118, 120) that prohibits foreign and/or free agent usersfrom participating in one or more bids in an effort to obtainprioritized network services. In other examples, the wireless serviceprovider may implement a policy that allows all users (both subscribers,foreign and/or free agent users) one or more opportunities toparticipate in one or more bids in an effort to obtain prioritizednetwork services. In still other examples, the wireless service providermay implement a hybrid policy that allows all users such opportunitiesuntil a communication cell area bandwidth capacity threshold(s) isreached, after which only subscribers may continue to participate.

In the event the user is not allowed to participate (block 522), thenthe example bandwidth allocation engine 316 allocates bandwidth to thecorresponding wireless device 200 based on one or more local policiesassociated with the communication cell area (block 524). On the otherhand, in the event that the user is entitled to participate in rankednetwork priority services (block 522), then the example auction engine318 sends and/or otherwise transmits information related tonon-subscriber pricing to the requesting wireless device 200 (block526). Additionally, tier price information may be published on-lineand/or pushed to one or more wireless devices within the communicationcell area (block 519). For example, while both subscribers and foreignusers may be entitled to utilize ranked network priority services,foreign users may have a price structure different than that ofsubscribers. One or more bids received from the wireless device 200 areprocessed by the example auction engine 318 to determine a correspondingresource allocation (block 520), as described below.

In the illustrated example of FIG. 6, the example auction engine 318processes one or more bids and allocates resources (block 520). Theexample auction engine 318 ranks all users of the correspondingcommunication cell area (e.g., 116, 118, 120) based on their respectivebids, and includes the bid received by the current bidder (e.g., acandidate user of ranked network priority services) (block 602). Theexample ranking may employ GSP-based modeling, in which N users competefor M<N communication channels available in a cell tower. The exampleGSP modeling allows each user (bidder) to bid an amount he/she iswilling to pay for such communication channels. A wireless serviceprovider and/or entity managing a cell tower may have a valuation v_(i),and may receive bids b_(i), in which i has a set membership of 1 throughN users. An example ranking function g(i) may map users to channels. Byemploying GSP auctioning, the price charged depends on the price bid bythe corresponding user or by the next best competitor for the allocatedresources.

The example function g(i) seeks to rank the users based on a product ofthe bid b_(i) and a policy specific measure u_(i). The policy specificmeasure u_(i) may be established by any type of search auction policysuch as Rank-by-Bids (RBB) (e.g., a highest bid policy), orRank-by-Revenue (RBR) (e.g., a highest profit policy). For example, apolicy specific measure modeled after the RR policy (u_(i),RR) may beset to a value of unity in an effort to promote a degree of fairness. Inother examples, a policy specific measure modeled after the PF policy(u_(i),PF) may be set to a value equal to the ratio of the user'sinstantaneous throughput of data and their average throughput. In stillother examples, one or more congestion factors may be considered and/orotherwise calculated to promote and/or inflate prices that will resultin a winning bid. For example, in the event a communication cell area isburdened with a relatively large number of wireless device data accessrequest(s), and/or when a data rate and/or capacity of the cell towerexceeds a threshold, a corresponding premium price and/or base price forprivileged services may be promoted via the one or more congestionfactors. In effect, the example congestion factors may inflate the baseprice for services when one or more congestion metrics are relativelyhigh. Such policies may be implemented in any wireless technologyincluding, but not limited to, 2G, 3G, 4G, LTE, etc. Additionally, theone or more policies may be implemented in one or more portions of awireless network, core network, radio access network, and/orcombinations thereof.

Some example methods, apparatus, systems and/or articles of manufacturedisclosed herein employ a proportional fair auction (PFauc) schedulingpolicy as a variant of PF that includes one or more bids from the usersin its ranking. In particular, the example PFauc policy ranks usersbased on the product of bids to the ratio of the user's instantaneousthroughput of data (S_(K)) and their average throughput ( S_(K) ) in amanner consistent with example Equation 1.

$\begin{matrix}{b_{k}{\frac{S_{k}}{\overset{\_}{S_{k}}}.}} & {{Equation}\mspace{14mu} 1}\end{matrix}$Expected payment for allocation of a resource may be determined in amanner consistent with example Equation 2.

$\begin{matrix}{b_{g^{- 1}{({{g{(k)}} + 1})}}{\frac{{\mu_{g - 1}\left( {{g(k)} + 1} \right)},{PFauc}}{\mu_{k,{PFauc}}}.}} & {{Equation}\mspace{14mu} 2}\end{matrix}$

In operation, the example auction engine 318 allows each bidder tosubmit only one active bid and not separate bids for each instance ofchannel allocation from the core network 113 and/or components thereof.Further, processing a bid for each instance of channel allocationbecomes impractical in view of, for example, a 2 mSec period with whichnodeB devices perform allocation activities. In the illustrated example,entered bids represent a user's request for channel resources and/ordata rate preferences. An actual calculated rank is based on thesupplied bid and the bid(s) received by other (competing) users.Resources are allocated in a manner that favors a higher bid amount. Ona periodic, aperiodic, scheduled and/or manual basis, a current and/orotherwise relatively recent bid amount value is published on a per-tierbasis so that candidate bidders can appreciate a general value forservice priority. A benefit of publishing per-tier price information isthat candidate bidders do not need to enter numerous bids that are belowa value that may result in receiving desired services. Such repeated bidentries may frustrate users, only to result in one or more bid failureswithout feedback as to a value that may result in success.

In the event a user's bid is unsuccessful at raising their correspondingbandwidth tier status (block 604), then the example bid interfacemanager 312 may prompt the user for a re-bid (block 606). If no re-bidis selected (block 606), the example bandwidth allocation engine 316associates the user with a bandwidth tier status in a manner consistentwith a default network priority service (block 608). As described above,default network priority services may include, but are not limited toround robin, maximum throughput, proportional fair, and/or anycombination thereof. On the other hand, if a re-bid is selected (block606), then the example process 520 returns to block 602.

In the event a user's bid is successful at raising their correspondingbandwidth tier status (block 604), then the example bandwidth allocationengine 316 allocates channelization resources for the user and/orthrottles and/or otherwise adjusts a data rate associated with theuser's wireless device via one or more elements of the core network 113(block 610) (e.g., data rate control via the corresponding core resourcemanager 128 a-c, data rate control via the nodeB, eNodeB, RNC, SGSN,GGSN, etc.). Users that previously operated with an elevated bandwidthtier status may be demoted to one or more lower bandwidth tier statuslevels in the event congestion in the tower is relatively high (and/orsuch users have been outbid). In the illustrated example, users that nolonger have competitive bid value(s) are demoted to one or more lowertier status levels and resources allocated to their correspondingwireless devices are deallocated (block 612). In some examples, awinning bid entitles the corresponding wireless device to participate inthe bandwidth tier status for a predetermined period of time, regardlessof demand changes in the corresponding communication cell area. Theexample congestion publisher 304 of the illustrated example communicatesone or more bandwidth tier status changes (e.g., up or down) via one ormore messages (block 614).

The program 700 of FIG. 7 illustrates example operation of the exampleauction manager 130 of FIG. 1. The program of FIG. 7 begins at block 702where the subscriber interface 402 monitors for a subscriber set-upand/or edit request. In the event no request to set-up a profile and/oredit a profile occurs (block 702), then the example program 700continues to monitor for such event(s). On the other hand, if a requestto set-up and/or edit a profile occurs (block 702), then the exampleprofile manager 404 facilitates profile editing and/or set-up (block704). As described above, the example profile manager 404 may include aweb server to generate one or more forms to present to a candidateand/or current subscriber. Forms may include, but are not limited to oneor more questions, drop-down selections and/or fields to tailor biddingpreferences, tailor default network priority tier level preferencesand/or tailor default preferences when visiting networks and/or towersoutside the control of a user's wireless service provider. For example,a profile may be configured via the example profile manager 404 tomaintain the user's wireless device at a top tier (e.g., highestperforming, most responsive, fastest data throughput) when in or aroundthe vicinity of New York city, but to maintain the user's wirelessdevice at a default tier in any other geographic location.

Edited and/or generated profiles may be stored by the example profilemanager 404 in the example profile store 406 (block 706). In someexamples, and as described above, the example subscriber query enginemay access profile information associated with one or more subscribersvia the example network 114, the auction manager 130 and/or the HLR/VLR310. In other examples, the core resource interface 408 may forwardprofile information to one or more core resource managers 128 a-c and/orone or more HLR/VLRs 310 within the example network 100 (block 708).

The program 800 of FIG. 8 illustrates example operation of the examplewireless device 200 of FIG. 2. The program of FIG. 8 begins at block 802where the wireless device 200 requests a metric associated with theuser's current tier status, bandwidth limit(s), data rate and/or acongestion metric associated with the communication area. Requests forsuch metrics may be prompted periodically, aperiodically, on a scheduledbasis and/or manually by an application installed and executing on theexample wireless device 200. As described above, the example metric(s)may be shown on the wireless device 200 as an icon, a graphic,alphanumeric text and/or any combination thereof. In some examples, acongestion indicator may appear as a pie chart that fills up when one ormore threshold capacity limits of a cell tower are reached. In otherexamples, the wireless device 200 may display a price indicator, such asthe example price indicator 210 of FIG. 2. The example wireless device200 may also request and display a bandwidth tier status, such as theexample bandwidth tier indicator 212 and/or 216 a-d of FIG. 2 (block804).

In the event a bid is entered via the example wireless device 200 (block806), then the bid value is sent to the example core resource manager128 a-c associated with a data communication area that is within acommunication range of the wireless device 200 (block 808). On the otherhand, if a bid is not entered, then the example wireless device 200and/or the bid update app 218 determines whether a tier statusassociated with the wireless device 200 has decreased (block 810). Ifnot, then the example program 800 returns control to block 802 todetermine a current congestion metric on a periodic, aperiodic,scheduled and/or manual basis. If the tier status associated with thewireless device 200 has decreased (block 810), then the wireless device200 and/or the bid update app 218 determines whether the wireless device200 includes associated profile instructions (block 812). If so, thenone or more bid instructions may be performed in a manner consistentwith the profile designed and/or otherwise developed by the userassociated with the example wireless device 200 (block 814).

Profile instructions may be stored in a memory of the wireless device200 and/or may be wirelessly retrieved by accessing the subscriber queryengine 308 and/or the local subscriber store 314 of the core resourcemanager 128 a-c, and/or may be wirelessly retrieved by accessing one ormore HLR/VLRs 310 of the network 100. In the event there are no profileinstructions that correspond to the wireless device 200 and/or the userof the wireless device 200, then the example wireless device 200modifies one or more indicators, such as the example bandwidth tierindicator 212, 214 a-e and/or a price indicator 210 associated with aprice to receive different bandwidth tier services (block 816).Modification of the bandwidth tier indicator(s) 212, 214 a-e mayinclude, but is not limited to flashing, one or more animations and/oraudio/vibration cues.

FIG. 9 is a block diagram of an example processing platform P100 capableof executing the instructions of FIGS. 5-8 to implement the examplenetwork 100, the example core resource manager 128 a-c and the exampleauction manager 130 of FIGS. 1-4. The processor platform P100 can be,for example, a server, a personal computer, a tablet, a mobile phone, orany other type of computing device.

The processor platform P100 of the instant example includes a processorP105. For example, the processor P105 can be implemented by one or moreIntel® microprocessors. Of course, other processors from other familiesare also appropriate.

The processor P105 is in communication with a main memory including avolatile memory P115 and a non-volatile memory P120 via a bus P125. Thevolatile memory P115 may be implemented by Synchronous Dynamic RandomAccess Memory (SDRAM), Dynamic Random Access Memory (DRAM), RAMBUSDynamic Random Access Memory (RDRAM) and/or any other type of randomaccess memory device. The non-volatile memory P120 may be implemented byflash memory and/or any other desired type of memory device. Access tothe main memory P115, P120 is typically controlled by a memorycontroller.

The processor platform P100 also includes an interface circuit P130. Theinterface circuit P130 may be implemented by any type of past, presentor future interface standard, such as an Ethernet interface, a universalserial bus (USB), and/or a PCI express interface.

One or more input devices P135 are connected to the interface circuitP130. The input device(s) P135 permit a user to enter data and commandsinto the processor P105. The input device(s) can be implemented by, forexample, a keyboard, a mouse, a touchscreen, a track-pad, a trackball,isopoint and/or a voice recognition system.

One or more output devices P140 are also connected to the interfacecircuit P130. The output devices P140 can be implemented, for example,by display devices (e.g., a liquid crystal display, and/or a cathode raytube display (CRT)). The interface circuit P130, thus, typicallyincludes a graphics driver card.

The interface circuit P130 also includes a communication device, such asa modem or network interface card to facilitate exchange of data withexternal computers via a network (e.g., an Ethernet connection, adigital subscriber line (DSL), a telephone line, coaxial cable, acellular telephone system, etc.).

The processor platform P100 also includes one or more mass storagedevices P150 for storing software and data. Examples of such massstorage devices P150 include floppy disk drives, hard drive disks,compact disk drives and digital versatile disk (DVD) drives.

The coded instructions of FIGS. 5-8 may be stored in the mass storagedevice P150, in the volatile memory P110, in the non-volatile memoryP112, and/or on a removable storage medium such as a CD or DVD.

From the foregoing, it will be appreciated that disclosed examplemethods, apparatus, systems and/or articles of manufacture allowwireless devices to bid to participate in one or more levels of networkaccess. In the event that a particular geographic area (e.g., a celltower) includes a relatively high number of wireless devices, examplemethods, apparatus, systems and/or articles of manufacture disclosedherein may provide a degree of relief to the corresponding area of thenetwork by allocating channel resources that correspond to uservaluation.

Although certain example methods, apparatus and articles of manufacturehave been described herein, the scope of coverage of this patent is notlimited thereto. On the contrary, this patent covers all methods,apparatus and articles of manufacture fairly falling within the scope ofthe claims of this patent.

What is claimed is:
 1. A method to allocate resources of a wirelessnetwork, comprising: calculating a rank of a first wireless devicerelative to a plurality of wireless devices based on a first bid valueassociated with the first wireless device; allocating a first bit rateto the first wireless device based on the rank of the first wirelessdevice at a first time; and in response to detecting a change inavailability of the first bit rate at a second time, applying a secondbid value for a second bit rate when the first wireless device islocated in a first geographic area, and applying a third bid value forthe second bit rate when the first wireless device is located in asecond geographic area different from the first geographic area.
 2. Amethod as defined in claim 1, further comprising establishing a baseprice for the first bit rate when a threshold associated with a wirelesscore network is satisfied.
 3. A method as defined in claim 1, whereinallocating the first bit rate comprises allocating a quantity ofchannelization codes to the first wireless device based on the rank. 4.A method as defined in claim 1, further comprising obtaining the firstbid value from a profile associated with the first wireless device.
 5. Amethod as defined in claim 4, wherein the profile comprises an automaticbid instruction.
 6. A method as defined in claim 5, wherein theautomatic bid instruction is selected based on a first geographic areaof the first wireless device.
 7. A method as defined in claim 4, whereinthe profile comprises an automatic bid instruction corresponding to afirst time of day.
 8. A method as defined in claim 7, wherein theautomatic bid instruction specifies the first bid value for the firsttime of day, and the second bid value for the second time.
 9. A methodas defined in claim 1, further comprising calculating a price of thefirst bit rate.
 10. A method as defined in claim 9, wherein calculatingthe price for the first bit rate is based on at least one of the firstbid value, a bid value of a next highest bidder, or an operatingcharacteristic of the first wireless device.
 11. An apparatus toallocate resources of a wireless network, comprising: a bid interfacemanager to obtain a first bid value associated with a first wirelessdevice; an auction engine to identify a rank of the first wirelessdevice with a plurality of wireless devices based on the first bid valueassociated with the first wireless device; and a bandwidth allocationengine to: allocate a first bit rate to the first wireless device basedon the rank of the first wireless device at a first time; and inresponse to detecting a change in availability of the first bit rate ata second time: apply a second bid value for a second bit rate when thefirst wireless device is located in a first geographic area; and apply athird bid value for the second bit rate when the first wireless deviceis located in a second geographic area different from the firstgeographic area.
 12. An apparatus as defined in claim 11, wherein thebandwidth allocation engine is to control the first bit rate associatedwith the first wireless device via at least one of a nodeB, a radionetwork controller, an eNodeB, or a general packet radio service supportnode.
 13. An apparatus as defined in claim 11, further comprising abandwidth monitor to measure at least one of a data capacity, a datarate, an average data rate, or a channel quality associated with awireless network.
 14. An apparatus as defined in claim 11, wherein theauction engine is to establish a base price for the first bit rate orthe second bit rate when a threshold associated with a wireless corenetwork is satisfied.
 15. A tangible machine readable storage devicecomprising instructions that, when executed, cause a machine to performoperations comprising: calculating a rank of a first wireless devicerelative to a plurality of wireless devices based on a first bid valueassociated with a first wireless device; allocating a first bit rate tothe first wireless device based on the rank of the first wireless at afirst time; and in response to detecting a change in availability of thefirst bit rate at a second time, applying a second bid value for asecond bit rate when the first wireless device is located in a firstgeographic area, and applying a third bid value for the second bit ratewhen the first wireless device is located in a second geographic areadifferent from the first geographic area.
 16. A tangible machinereadable storage device as defined in claim 15 having instructionsstored thereon that, when executed, cause the machine to measure atleast one of a data capacity, a data rate, an average data rate, orchannel quality associated with the wireless network.
 17. A tangiblemachine readable storage device as defined in claim 15 havinginstructions stored thereon that, when executed, cause the machine tocontrol the first bit rate associated with the first wireless device viaat least one of a nodeB, an eNodeB, a radio network controller, or ageneral packet radio service support node.
 18. A tangible machinereadable storage device as defined in claim 15 having instructionsstored thereon that, when executed, cause the machine to obtain the bidvalue from a user associated with the first wireless device.
 19. Atangible machine readable storage device as defined in claim 15 havinginstructions stored thereon that, when executed, cause the machine toapply a scheduling model based on a round-robin throughput prioritypolicy to allocate the resources proportionately between the firstwireless device and a second wireless device.
 20. A tangible machinereadable storage device as defined in claim 15 having instructionsstored thereon that, when executed, cause the machine to apply ascheduling model based on a proportional fair throughput priority policyto allocate the resources based on a ratio of a data rate and an averagedata rate of the first wireless device.